Multivariate extremes and the aggregation of dependent risks: examples and counter-examples

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof-Like Counter-Examples

Counter-examples explain why a desired temporal logic property fails to hold, and as such considered to be the most useful form of output from modelcheckers. Reported explanations are typically short and described in terms of states and transitions of the model; as a result, they can be effectively used for debugging. However, counter-examples are not available for every CTL property and are of...

متن کامل

Counter-examples to the correlated stability conjecture

We demonstrate explicit counter-examples to the Correlated Stability Conjecture (CSC), which claims that the horizon of a black brane is unstable precisely if that horizon has a thermodynamic instability, meaning that its matrix of susceptibilities has a negative eigenvalue. These examples involve phase transitions near the horizon. Ways to restrict or revise the CSC are suggested. One of our e...

متن کامل

Generalisations, Examples and Counter-examples in Analysis and Optimisation In honour of Michel Théra at 70

In this essay, I talk about the role of examples and counter-examples and of generalisation in mathematical research. I use geometric fixed point theory and nonsmooth optimisation to illustrate my opinions and conclude with a few recommendations.

متن کامل

Computability of invariant measures: two counter-examples

We are interested in the computability of the invariant measures in a computable dynamical system. We construct two counter-examples. The first one has a unique SRB measure, which is not computable. The second one has no computable invariant measure at all. The systems are topological, i.e. continuous transformations on compact spaces, so they admit invariant measures. A topological dynamical s...

متن کامل

Finding Counter Examples in Induction Proofs

This paper addresses a problem arising in automated proof of invariants of transition systems, for example transition systems modelling distributed programs. Most of the time, the actual properties we want to prove are too weak to hold inductively, and auxiliary invariants need to be introduced. The problem is how to find these extra invariants. We propose a method where we find minimal counter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Extremes

سال: 2008

ISSN: 1386-1999,1572-915X

DOI: 10.1007/s10687-008-0071-5